|
Contributions to https://mathsurgery.wikispaces.com/ are licensed under a Creative Commons Attribution Share-Alike Non-Commercial 3.0 License. Portions not contributed by visitors are Copyright 2018 Tangient LLC TES: The largest network of teachers in the world |
||
D1 chapter 7 - matchings
Bipartite graphs and matchingsTable of Contents
Sections
D1 section 7.1
Prerequisites:
- recall the definition of a bipartite graph
- recall the meaning of the notation Ki,j
Learning objectives: WALT- model matching problems with bipartite graphs
- use matching improvement algorithms
Examples:D1 Exercise 7A
D1 section 7.2